Phase demodulation method for minimizing phase error in communication signals

ABSTRACT

Disclosed is a phase-demodulation method for minimizing the phase error of a communication signal. The phase-demodulation method for demodulating a phase-demodulated communication signal using a digital phase-demodulation algorithm includes the steps of: adding one sampling to the digital phase-demodulation algorithm represented by an equation  
             F   k          (   x   )       =       ∑     k   =   0       k   -   1              C   k          x   k           ,                 
 
     where k is the number of sampling times and C k  is a complex constant; and, demodulating the phase-demodulated communication signal. Accordingly, the phase-demodulation method minimizes the phase error generated when a noise is propagated in phase space during a demodulation time of the phase-modulated communication signal, using a minimum number of sampling times and a minimum number of calculation times.

CLAIM OF PRIORITY

[0001] This application claims priority to an application entitled “PHASE DEMODULATION METHOD FOR MINIMIZING PHASE ERROR OF COMMUNICATION SIGNAL,” filed in the Korean Intellectual Property Office on Oct. 9, 2002 and assigned Serial No. 2002-61478, the contents of which are hereby incorporated by reference.

BACKGROUND OF THE INVENTION

[0002] 1. Field of the Invention

[0003] The present invention generally relates to a phase-demodulation method for demodulating a phase-modulated communication signal. More particularly, the present invention relates to a phase-demodulation method for minimizing the phase error generated by noise.

[0004] 2. Description of the Related Art

[0005] Typically, a phase-modulation/demodulation method in a communication field simultaneously varies and transmits the phase of sinusoidal waves of a predetermined frequency at intervals of a predetermined phase. Several problems causing distortions of the sinusoidal waves are created in such a process. An example of this is when a communication signal is loaded on a carrier wave and interference with other signals occurs, or noise is undesirably added to a desired signal, etc., thereby distorting the sinusoidal waves. If a signal having the distorted sinusoidal waves is received at a reception end, a frequency of the signal is adjusted down to an initial frequency and filtered to be proper to a signal bandwidth in such a way that the signal is demodulated to an original signal. Commonly, in case of describing the physical characteristics of a modulation/demodulation process, the above steps are simplified as a procedure for adding an independent Gaussian noise to an original signal. Provided that the Gaussian noise is not considered, signal waves received at a reception end can be represented by the following Equation 1. $\begin{matrix} {{w(\phi)} = {\sum\limits_{m}{\alpha_{m}^{\quad {m{({\phi + \phi_{0}})}}}}}} & \left\lbrack {{Eq}.\quad 1} \right\rbrack \end{matrix}$

[0006] In case of a digital phase demodulation, a demodulated signal is sampled at more than twice the original signal frequency. In this case, in case of representing a sampling interval as a phase interval of δ, a k-th sampled value is represented by the following Equation 2. $\begin{matrix} {w_{k} = {\sum\limits_{m}{\alpha_{m}^{\quad m\quad \phi_{0}}^{\quad {mk}\quad \delta}}}} & \left\lbrack {{Eq}.\quad 2} \right\rbrack \end{matrix}$

[0007] A method for demodulating values called I and Q signals from the above sampling signals is called a phase-demodulation algorithm. Such phase-demodulation algorithm can be represented by the following Equation 3. $\begin{matrix} \begin{matrix} {S = {\sum\limits_{k = 0}^{K - 1}{c_{k}w_{k}}}} \\ {c_{k} \equiv {a_{K} + {\quad b_{k}}}} \\ {{\therefore S} = {\sum\limits_{k = 0}^{K - 1}{\left( {a_{k} + {\quad b_{k}}} \right)w_{k}}}} \\ {I = {{real}\left\{ S \right\}}} \\ {Q = {{imag}\left\{ S \right\}}} \end{matrix} & \left\lbrack {{Eq}.\quad 3} \right\rbrack \end{matrix}$

[0008] Characteristics of the phase-demodulation algorithm are determined by a coefficient C_(k) used in a complex phasor S.

[0009]FIG. 1A is a view illustrating a constellation in a conventional 3-sample algorithm (i.e., 3-point algorithm). FIG. 1B is a view illustrating a phase-error distribution in a conventional 3-sample algorithm. FIG. 2A is a view illustrating a constellation in a conventional 4-sample algorithm (i.e., 4-point algorithm). FIG. 2B is a view illustrating a phase-error distribution in a conventional 4-sample algorithm.

[0010] Referring to FIGS. 1A and 2A, in case of considering an axis of 0° and an axis of 90° as reference lines, FIG. 1A using the 3-point algorithm shows that symbols α and β each have errors of almost 90° and the distribution of the errors is in a wide range. FIG. 2A using the 4-point algorithm shows that values of the symbols γ and δ are much less than the symbols α and β.

[0011] In addition, as shown in FIGS. 1B and 2B, the 4-point algorithm reduces the error distribution much more than the 3-point algorithm does.

[0012] It is noted that the aforesaid digital phase-demodulation algorithms more accurately calculate a signal phase in proportion to the number of sampling times and is also resistant to noise.

[0013] However, it is impossible to increase the number of sampling times indefinitely in case of a symbol rate of a very high value. Also, a processor used for phase calculation may receive an excessive load during a phase calculation time.

[0014] Therefore, there is a need for an optimized algorithm for calculating an accurate phase using a minimum number of sampling times and a minimum number of calculation times.

SUMMARY OF THE INVENTION

[0015] The present invention is to provide a phase-demodulation method for minimizing the phase error generated when a noise is propagated in phase space during a demodulation period of a phase-modulated communication signal.

[0016] One aspect of the present invention is to provide a phase-demodulation method for minimizing the phase error of a communication signal by calculating the accurate phase using a minimum number of sampling times and a minimum number of calculation times.

[0017] In yet another aspect of the present invention, a phase-demodulation method is provided for improving a phase-demodulation process applicable to various kinds of phase-demodulation algorithms by only changing a signal-processing method.

[0018] In one embodiment of the present invention, a phase-demodulation method for demodulating a phase-demodulated communication signal using a digital phase-demodulation algorithm, including the steps of: adding one sampling to the digital phase-demodulation algorithm represented by an equation ${{F_{k}(x)} = {\sum\limits_{k = 0}^{k - 1}{C_{k}x^{k}}}},$

[0019] where k is the number of sampling times and C_(k) is a complex constant; and, demodulating the phase-demodulated communication signal.

[0020] In the embodiment, the step of adding one sampling for a phase-error minimization to the digital phase-demodulation algorithm may be represented by the following equation: $\begin{matrix} {{{F^{\prime}}_{K + 1}(x)} = {\sum\limits_{k = 0}^{K - 1}{c_{k}{x^{k}\left( {\lambda - x} \right)}}}} \\ {= {{\sum\limits_{k = 0}^{K - 1}{c_{k}\lambda \quad x^{k}}} - {\sum\limits_{k = 0}^{K - 1}{c_{k}x^{k + 1}}}}} \\ {= {{c_{0}\lambda} + {\sum\limits_{k = 0}^{K - 1}{c_{k}\lambda \quad x^{k\quad}}} - {\sum\limits_{k = 0}^{K - 1}{c_{k - 1}x^{k}}} - {c_{K - 1}x^{K}}}} \\ {= {{c_{0}\lambda} - {c_{K - 1}x^{K}} + {\sum\limits_{k = 0}^{K - 1}{\left( {{c_{k}\lambda} - c_{k - 1}} \right)x^{k}}}}} \\ {\equiv {\sum\limits_{k = 0}^{K}{d_{k}x^{k}}}} \end{matrix}$

[0021] where k is the number of sampling times, C_(k) and d_(k) are complex constants, and λ−x indicates the one sampling added in the step.

[0022] In the embodiment, the phase-error minimization may be determined by the value of λ satisfying the following equation: $\begin{matrix} {\gamma^{2} = {{\sum\limits_{k = 0}^{K}d_{k}^{2}}}} \\ {= {{c_{0}^{2}\lambda^{2}} + c_{K - 1}^{2} + {\sum\limits_{k = 1}^{K - 1}\left( {{c_{k}^{2}\lambda^{2}} + c_{k - 1}^{2} - {2c_{k - 1}c_{k}\lambda}} \right)}}} \\ {= {{\sum\limits_{k = 0}^{K - 1}{c_{k}^{2}\lambda^{2}}} - {2{\sum\limits_{k = 1}^{K - 1}{c_{k - 1}c_{k}\lambda}}} + {\sum\limits_{k = 0}^{K - 1}c_{k}^{2}}}} \end{matrix}$

[0023] where k is the number of sampling times, C_(k) and d_(k) are complex constants, and γ is a phase error.

BRIEF DESCRIPTION OF THE DRAWINGS

[0024]FIG. 1A is a view illustrating a constellation in a conventional 3-sample algorithm (i.e., 3-point algorithm);

[0025]FIG. 1B is a view illustrating a phase-error distribution in a conventional 3-sample algorithm;

[0026]FIG. 2A is a view illustrating a constellation in a conventional 4-sample algorithm (i.e., 4-point algorithm);

[0027]FIG. 2B is a view illustrating a phase-error distribution in a conventional 4-sample algorithm;

[0028]FIG. 3 is a view illustrating the relationship between phase magnitude and phase deviation in the case where noise added to the original signal is propagated in a phase plane;

[0029]FIG. 4A is a view illustrating a constellation in a conventional 4-sample algorithm (i.e., 4-point algorithm) in accordance with a preferred embodiment of the present invention; and,

[0030]FIG. 4B is a view illustrating a phase-error distribution in a conventional 4-sample algorithm in accordance with a preferred embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0031] In accordance with the present invention, preferred embodiments of the present invention will be described in detail with reference to the annexed drawings. In the drawings, the same or similar elements are denoted by the same reference numerals even though they are depicted in different drawings. For the purposes of clarity and simplicity, a detailed description of known functions and configurations incorporated herein will be omitted as it may make the subject matter of the present invention unclear.

[0032] The present invention relates to a method for minimizing a phase error in the case where physical noises are propagated in the phase spaces (i.e., I and Q spaces) of a signal in the step for determining the coefficient C_(k). In the case where Gaussian noise having an average value of 0 and a standard deviation of σ is added to signal waveforms during a communication step, sampled signals are affected by the Gaussian noise as shown in the following Equation 4.

w′ _(k) =w _(k) +Δw _(k)

<Δw _(k)>=0

<Δw_(j) *Δw _(k)>=σ²δ_(jk)  [Eq. 4]

[0033] The above signals are propagated with a complex phasor S as shown in the following Equation 5. $\begin{matrix} \begin{matrix} {S^{\prime} = {\sum\limits_{k = 0}^{K - 1}{c_{k}w_{k}^{\prime}}}} \\ {= {{\sum\limits_{k = 0}^{K - 1}{c_{k}w_{k}}} + {\sum\limits_{k = 0}^{K - 1}{c_{k}\Delta \quad w_{k}}}}} \\ {= {S + {\Delta \quad S}}} \end{matrix} & \left\lbrack {{Eq}.\quad 5} \right\rbrack \end{matrix}$

[0034] Errors of the complex phasor S can be represented as a magnitude error <|ΔS|²> and an angle error <|Δφ|²> in phase space.

[0035]FIG. 3 is a view illustrating the relationship between phase magnitude and phase deviation in the case where noise added to an original signal is propagated in a phase plane. Particularly, FIG. 3 shows that the noise propagated in the phase space spreads a complex phasor S so that a phase error occurs.

[0036] The aforesaid magnitude error and phase error of the complex phasor can be represented by the following Equation 6. In case of the phase error, the Taylor expansion method is used on the assumption that the phase error is low, and the value corresponding to a linear term is further reflected in a calculation procedure. $\begin{matrix} \begin{matrix} {{\langle{\Delta \quad S}\rangle} = 0} \\ {{\langle{{\Delta \quad S}}^{2}\rangle} = {\sum\limits_{k = 0}^{K - 1}{{c_{k}}^{2}\sigma^{2}}}} \\ {= {\rho^{2}\sigma^{2}}} \\ {{{\langle{{\Delta \quad \phi}}^{2}\rangle} \cong {\frac{\sigma^{2}}{{S}^{2}}\left\{ {\rho^{2} - {\gamma^{2}{\cos \left\lbrack {2\left( {\phi - \theta} \right)} \right\rbrack}}} \right\}}},\left( {{{\Delta \quad \phi}}1} \right)} \\ {\rho^{2} = {\sum\limits_{k = 0}^{K - 1}{c_{k}}^{2}}} \\ {\gamma^{2} = {{\sum\limits_{k = 0}^{K - 1}c_{k}^{2}}}} \\ {\theta = {\frac{1}{2}{\arg \left( {\sum\limits_{k = 0}^{K - 1}c_{k}^{2}} \right)}}} \end{matrix} & \left\lbrack {{Eq}.\quad 6} \right\rbrack \end{matrix}$

[0037] A constant C_(k) for minimizing an error of the complex phasor can be calculated by the above Eq. 6. The magnitude error is of little importance in a phase-modulation/demodulation method. It is necessary to minimize the phase error only. Provided that a signal phase φ is contained in the phase error, the value <|Δφ|²> of the phase error ranges from a minimum value σ²/|S|²[ρ²+γ²] to a maximum value σ²/|S|²[ρ²−γ²]. Therefore, in order to minimize the phase-error value, only γ² should be minimized.

[0038] Therefore, in order to minimize the phase error in a phase-demodulation algorithm for demodulating phase-modulated communication signals, a phase-demodulation algorithm needs to demodulate an accurate phase, and the value of γ² should be zero. In order to recognize a principle for enabling the phase-demodulation algorithm to demodulate an accurate phase, the complex phasor S is represented by the following Equation 7. $\begin{matrix} \begin{matrix} {S = {\sum\limits_{k = 0}^{K - 1}{c_{k}w_{k}}}} \\ {= {\sum\limits_{k = 0}^{K - 1}{c_{k}{\sum\limits_{m}{\alpha_{m}^{\quad m\quad \phi_{0}}^{\quad {mk}\quad \delta}}}}}} \\ {= {\sum\limits_{m}{\alpha_{m}^{\quad m\quad \phi_{0}}{\sum\limits_{k = 0}^{K - 1}{c_{k}^{\quad m\quad \delta}}}}}} \\ {= {\sum\limits_{m}{\alpha_{m}^{\quad m\quad \phi_{0}}{F_{K}\left( ^{\quad m\quad \delta} \right)}}}} \\ {{F_{K}(x)} = {\sum\limits_{k = 0}^{K - 1}{c_{k}x^{k}}}} \end{matrix} & \left\lbrack {{Eq}.\quad 7} \right\rbrack \end{matrix}$

[0039] Considering that the complex phasor S must have a phase of φ₀, a value of F_(k)(e^(imδ)) must be 0 in case of m≠1, or should be 1 in case of m=1. So, F_(k)(x) can be represented as a characteristic polynomial having the solution value of e^(imδ) in case of m≠1. Herein, there is no problem in the phase demodulation step even though F_(k)(x) has another solution value. In case of using an arbitrary phase-demodulation algorithm, i.e., in case F_(k)(x) is fixed to a predetermined value, there is no problem even though a specific value of λ−x in case of λ≠e^(iδ) is multiplied by the value of F_(k)(x).

[0040] Therefore, one arbitrary solution is added to an arbitrary phase-demodulation characteristic polynomial so that a phase error is reduced. If a solution is added to a characteristic polynomial, the degree of the characteristic polynomial increases and the value of K also increases so that the number of sampling points (i.e., times) increases by one. If the number of sampling times increases, reduction of the phase error is reasonable. If a wrong phase-demodulation algorithm is adopted even though the number of sampling times increases, the phase error may be excessively higher. However, a phase-demodulation algorithm created in accordance with the present invention can minimize the phase error at all times.

[0041] First of all, one solution is added to an arbitrary phase-demodulation characteristic polynomial as shown in the following Equation 8. ${{F_{K + 1}^{\prime}(x)} = {{\sum\limits_{k = 0}^{K - 1}\quad {c_{k}{x^{k}\left( {\lambda - x} \right)}}}\quad  = {{{\sum\limits_{k = 0}^{K - 1}\quad {c_{k}\lambda \quad x^{k}}} - {\sum\limits_{k = 0}^{K - 1}\quad {c_{k}x^{k + 1}}}}\quad \quad = {{{c_{0}\lambda} + {\sum\limits_{k = 1}^{K - 1}\quad {c_{k}\lambda \quad x^{k}}} - {\sum\limits_{k = 1}^{K - 1}\quad {c_{k - 1}x^{k}}} - {c_{K - 1}x^{K}}} = {{{c_{0}\lambda} - {c_{K - 1}x^{K}} + {\sum\limits_{k = 1}^{K - 1}{\left( {{c_{k}\lambda} - c_{k - 1}} \right)x^{k}}}}\quad  \equiv {\sum\limits_{k = 0}^{K}\quad {d_{k}x^{k}}}}}}}}\quad$

[0042] In addition, in order to minimize the phase error, the following Equation 9 must be satisfied. $\gamma^{2} = {{{\sum\limits_{k = 0}^{K}\quad d_{k}^{2}}}\quad = {{{c_{0}^{2}\lambda^{2}} + c_{K - 1}^{2} + {\sum\limits_{k = 1}^{K - 1}\left( {{c_{k}^{2}\lambda^{2}} + c_{k - 1}^{2} - {2c_{k - 1}c_{k}\lambda}} \right)}}\quad = {{{\sum\limits_{k = 0}^{K - 1}{c_{k}^{2}\lambda^{2}}} - {2{\sum\limits_{k = 1}^{K - 1}{c_{k - 1}c_{k}\lambda}}} + {\sum\limits_{k = 0}^{K - 1}c_{k}^{2}}} = 0}}}$

[0043] In case of making a phase-demodulation algorithm by calculating the value of λ from a quadratic equation related to λ shown in the above Eq. 9, a phase error can be minimized regardless of Gaussian noise being added to communication signals. Although the present invention is described on the assumption that the phase error has a low value, more effective results can be obtained if the present invention is actually applied to a phase modulation/demodulation method for subdividing phase intervals.

[0044]FIG. 4A is a view illustrating a constellation in a conventional 4-sample algorithm (i.e., 4-point algorithm) in accordance with a preferred embodiment of the present invention. FIG. 4b is a view illustrating a phase-error distribution in a conventional 4-sample algorithm in accordance with a preferred embodiment of the present invention. As shown in FIG. 4A, the magnitudes of ε and θ are much less than α and β shown in FIG. 1A using the conventional 3-point algorithm and γ and δ shown in FIG. 2A using the conventional 4-point algorithm.

[0045] The following Table 1 is provided to illustrate the relationship among three kinds of phase-demodulation algorithms for performing a phase-demodulation operation by sampling a phase of input signals at intervals of π/3 radians. In this case, all the algorithms are designed to calculate the phase by automatically removing DC components from the input signals. TABLE 1 3-sample 4-sample 3-sample algorithm + algorithm algorithm 1-sample algorithm 0, π/3, 2π/3 0, π/3, 2π/3, π 0, π/3, 2π/3, π a_(k) {1, −1.5, 0.5} {1, −1, −1, 1} {1, −0.75, −1.198, 0.9478} b_(k) {0, 0.8660, {0, 1.732, {0, 1.528, −1.209, −0.8660} −1.732, 0} −0.3188} Phase 0.02540 0.01386 0.01342 deviation (Maximum) (Maximum) [rad] 0.04678 0.02023 (Minimum) (Minimum)

[0046] The signal used for such phase demodulation is represented by the equation of 0.1+cos(φ), and the Gaussian noise having a standard deviation of 0.1 is added to this signal.

[0047] As shown above, Table 1 illustrates a first conventional algorithm for performing a phase-demodulation operation using three samplings (i.e., 3-sample algorithm or 3-point algorithm), and a second conventional algorithm using four samplings (i.e., 4-sample algorithm or 4-point algorithm). Based on Table 1, variables of a_(k) and b_(k) and maximum and minimum values of phase deviation can be recognized. Further, in accordance with the present invention shown in the third column of Table 1, one sampling is added to the 3-sample algorithm to create an algorithm (i.e., 4-sample algorithm) for minimizing a phase error so that variables of a_(k) and b_(k) and maximum and minimum values of phase deviations also can be recognized.

[0048] The second conventional algorithm shown in the second column of Table 1 and the algorithm of the present invention shown in the third column of Table 1 perform four samplings, so that they can be compared with each other directly as shown in Table 1. Apparently from Table 1, the inventive algorithm shown in the third column calculates a phase more accurately than the second conventional algorithm shown in the second column.

[0049] As is apparent from the above description, since a phase-demodulation method according to the present invention demodulates a phase-modulated communication signal by adding one sampling minimizing the phase error to an arbitrary digital phase-demodulation algorithm, it minimizes the phase error generated when a noise is propagated in phase space during a demodulation time of the phase-modulated communication signal, using a minimum number of sampling times and a minimum number of calculation times.

[0050] Furthermore, a phase-demodulation method according to the present invention is applied easily to various kinds of phase-demodulation algorithms by only changing the signal-processing method, thereby improving the phase-demodulation process.

[0051] While the invention has been shown and described with reference to a preferred embodiment thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims. Therefore, this invention is not to be unduly limited to the embodiment set forth herein, but to be defined by the appended claims and the equivalents thereof. 

What is claimed is:
 1. A phase-demodulation method for demodulating a phase-demodulated communication signal through a predetermined number of samplings using a digital phase-demodulation algorithm, comprising the steps of: adding one sampling to the digital phase-demodulation algorithm represented by an equation $\quad {{{F_{k}(x)} = {\sum\limits_{k = 0}^{k - 1}{C_{k}x^{k}}}},}$

 where k represents the number of sampling times and C_(k) represents a complex constant; and, demodulating the phase-demodulated communication signal.
 2. The phase-demodulation method according to claim 1, wherein the step of adding one sampling for a phase-error minimization to the digital phase-demodulation algorithm is represented by the following equation: ${{F_{K + 1}^{\prime}(x)} = {{\sum\limits_{k = 0}^{K - 1}\quad {c_{k}{x^{k}\left( {\lambda - x} \right)}}}\quad  = {{{\sum\limits_{k = 0}^{K - 1}\quad {c_{k}\lambda \quad x^{k}}} - {\sum\limits_{k = 0}^{K - 1}\quad {c_{k}x^{k + 1}}}}\quad \quad = {{{c_{0}\lambda} + {\sum\limits_{k = 1}^{K - 1}\quad {c_{k}\lambda \quad x^{k}}} - {\sum\limits_{k = 1}^{K - 1}\quad {c_{k - 1}x^{k}}} - {c_{K - 1}x^{K}}} = {{{c_{0}\lambda} - {c_{K - 1}x^{K}} + {\sum\limits_{k = 1}^{K - 1}{\left( {{c_{k}\lambda} - c_{k - 1}} \right)x^{k}}}}\quad  \equiv {\sum\limits_{k = 0}^{K}\quad {d_{k}x^{k}}}}}}}}\quad$

where k represents the number of sampling times, C_(k) and d_(k) are complex constants, and λ−x indicates the one sampling added.
 3. The phase-demodulation method according to claim 2, wherein the phase-error minimization is determined by a value of λ satisfying the following equation: $\gamma^{2} = {{{\sum\limits_{k = 0}^{K}\quad d_{k}^{2}}}\quad = {{{c_{0}^{2}\lambda^{2}} + c_{K - 1}^{2} + {\sum\limits_{k = 1}^{K - 1}\left( {{c_{k}^{2}\lambda^{2}} + c_{k - 1}^{2} - {2c_{k - 1}c_{k}\lambda}} \right)}}\quad = {{\sum\limits_{k = 0}^{K - 1}{c_{k}^{2}\lambda^{2}}} - {2{\sum\limits_{k = 1}^{K - 1}{c_{k - 1}c_{k}\lambda}}} + {\sum\limits_{k = 0}^{K - 1}c_{k}^{2}}}}}$

where k is the number of sampling times, C_(k) and d_(k) are complex constants, and γ is a phase error. 